Dynamic family of multicommodity inventory problems.
نویسندگان
چکیده
منابع مشابه
Dynamic Control of Multicommodity Fleet Management Problems
Dynamic eet management problems with multiple equipment types and limited substitution can be modeled as dynamic, multicommodity network ow problems. These problems are further complicated by the presence of time windows on task arcs (a task, or load, can be handled at di erent points in time) and the need for integer solutions. In this paper, we formulate the problem as a dynamic control probl...
متن کاملMulticommodity Network Flow Problems
In this paper, we consider to apply a primal-dual proximal point algorithm to the multicommodity network flow problem. A remarkable feature of the algorithm consists in how to find an approximate saddle point of the augmented Lagrangian of the problem. In particular, at each iteration, an approximate solution of the subproblem always satisfies the flow conservation equations for all commodities...
متن کاملTwo problems in multicommodity networks
— The problem ofmaximizing the sum offlows in a multicommodity network has been studied by Ford and Fulkerson, and they provided an aîgorithm, involving column génération, for Computing the maximal flows. In this paper, considering afinite traversai time for each commodity along each arc, two problems of interest are studied. In thefirst problem the objective is one ofmaximizing the sum offlows...
متن کاملDewey a Scaling Algorithm for Multicommodity Flow Problems a Scaling Algorithm for Multicommodity Flow Problems
We present a penalty-based algorithm that solves the multicommodity flow problem as a sequence of a fmite number of scaling phases. In the 8-scaling phase the algorithm determines an eoptimal solution, that is, one in which complementary slackness conditions are satisfied to within 8. We analyze the performance of the algorithm from both the theoretical and practical perspectives.
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Center Publications
سال: 1985
ISSN: 0137-6934,1730-6299
DOI: 10.4064/-14-1-439-452